Minsum k-sink problem on path networks
نویسندگان
چکیده
منابع مشابه
Minimax Regret k-sink Location Problem in Dynamic Path Networks
This paper considers minimax regret 1-sink location problems in dynamic path networks. A dynamic path network consists of an undirected path with positive edge lengths and constant edge capacity and the vertex supply which is nonnegative value, called weight, is unknown but only the interval of weight is known. A particular assignment of weight to each vertex is called a scenario. Under any sce...
متن کاملImproved Algorithms for Computing k-Sink on Dynamic Path Networks
We present a novel approach to finding the k-sink on dynamic path networks with general edge capacities. Our first algorithm runs in O(n logn + k2 log4 n) time, where n is the number of vertices on the given path, and our second algorithm runs in O(n log3 n) time. Together, they improve upon the previously most efficient O(kn log2 n) time algorithm due to Arumugam et al. [1] for all values of k...
متن کاملOn the K shortest path trees problem
We address the problem for finding the K best path trees connecting a source node with any other non-source node in a directed network with arbitrary lengths. The main result in this paper is the proof that the kth shortest path tree is adjacent to at least one of the previous (k−1) shortest path trees. Consequently, we design an O(+Km) time and O(K+m) space algorithm to determine the K shortes...
متن کاملSOLVING BEST PATH PROBLEM ON MULTIMODAL TRANSPORTATION NETWORKS WITH FUZZY COSTS
Numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. Other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(FSPP). The main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the co...
متن کاملPolynomial-time approximability of the k-Sink Location problem
A dynamic network N = (G, c, τ, S) where G = (V,E) is a graph, integers τ (e) and c(e) represent, for each edge e ∈ E, the time required to traverse edge e and its nonnegative capacity, and the set S ⊆ V is a set of sources. In the k-Sink Location problem, one is given as input a dynamic network N where every source u ∈ S is given a nonnegative supply value σ(u). The task is then to find a set ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2020
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2019.05.047